منابع مشابه
Hamiltonian chromatic number of block graphs
Let G be a simple connected graph of order n. A hamiltonian coloring c of a graph G is an assignment of colors (non-negative integers) to the vertices of G such that D(u, v) + |c(u) − c(v)| ≥ n − 1 for every two distinct vertices u and v of G, where D(u, v) denotes the detour distance between u and v in G which is the length of the longest path between u and v. The value hc(c) of a hamiltonian ...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملHamiltonian properties of Toeplitz graphs
Condit ions are given for the existence of hamiltonian paths and cycles in the so-called Toeplitz graphs, i.e. simple graphs with a symmetric Toeplitz adjacency matrix.
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملHamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-connected, linearly convex triangular grid graphs (with the exception of one of them) are hamiltonian. The only exception is a graph D which is the linearlyconvex hull of the Star of David. We extend this result to a wider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.061